Research Abstract: Planning Under Uncertainty via Stochastic Satisfiability
نویسنده
چکیده
Our research has successfully extended the planningas-satisfiability paradigm to support contingent planning under uncertainty (uncertain initial conditions, probabilistic effects of actions, uncertain state estimation). Stochastic satisfiability (SSAT), ty pe of Boolean satisfiability problem in which some of the variables have probabilities attached to them, forms the basis of this extension. We have developed an SSAT framework, explored the behavior of randomly generated SSAT problems, and developed algorithms for solving SSAT problems (Littman, Majercik, & Pitassi 2000). We have also shown that stochastic satisfiability can model compactly represented artificial intelligence planning domains, an insight that led to the development of ZANDER, an implemented framework for contingent planning under uncertainty using stochastic satisfiability (Majercik 2000).
منابع مشابه
Position Statement: Contingent Planning in Partially Observable Stochastic Domains via Stochastic Satisfiability
Our research has successfully extended the plann!ngas-satisfiability paradigm to support contingent planning under uncertainty (uncertain initial conditions, probabilistic effects of actions, uncertain state estimation). Stochastic satisfiability (SSAT), type of Boolean satisfiability problem in which some of the variables have probabilities attached to them, forms the basis of this extension. ...
متن کاملContingent Planning Under Uncertainty via Stochastic Satisfiability
We describe a new planning technique that efficiently solves probabilistic propositional contingent planning problems by converting them into instances of stochastic satisfiability (SSat) and solving these problems instead. We make fundamental contributions in two areas: the solution of SSat problems and the solution of stochastic planning problems. This is the first work extending the planning...
متن کاملTwo-stage Stochastic Programing Based on the Accelerated Benders Decomposition for Designing Power Network Design under Uncertainty
In this paper, a comprehensive mathematical model for designing an electric power supply chain network via considering preventive maintenance under risk of network failures is proposed. The risk of capacity disruption of the distribution network is handled via using a two-stage stochastic programming as a framework for modeling the optimization problem. An applied method of planning for the net...
متن کاملA Stochastic Programming Approach for a Multi-Site Supply Chain Planning in Textile and Apparel Industry under Demand Uncertainty
In this study, a new stochastic model is proposed to deal with a multi-product, multi-period, multi-stage, multi-site production and transportation supply chain planning problem under demand uncertainty. A two-stage stochastic linear programming approach is used to maximize the expected profit. Decisions such as the production amount, the inventory level of finished and semi-finished product, t...
متن کاملA Temporal Logic for Planning under Uncertainty
Dealing with uncertainty in the context of planning has been an active research subject in AI. Addressing the case when uncertainty evolves over time can be difficult. In this work, we provide a solution to this problem by proposing a temporal logic to reason about quantities and probability. For this logic, we provide a PSPACE SAT algorithm together with a complete calculus. The algorithm enab...
متن کامل